Complexity of t-tautologies
نویسندگان
چکیده
A t-tautology (triangular tautology) is a propositional formula which is a tautology in all fuzzy logics deened by continuous triangular norms. In this paper we show that the problem of recognizing t-tautologies is coNP complete, and thus decidable.
منابع مشابه
Nisan-Wigderson generators in proof systems with forms of interpolation
Proof complexity generators are used to define candidate hard tautologies for strong proof systems like Frege proof system or Extended Frege. They were independently introduced by Krajı́ček [3] and by Alekhnovich, Ben-Sasson, Razborov, and Wigderson [1]. Roughly speaking, the tautologies encode the fact that b / ∈ Rng(g) for an element b outside of the range of a generator g : {0, 1} 7−→ {0, 1},...
متن کاملNondeterministic Instance Complexity and Hard-to-Prove Tautologies
In this note we rst formalize the notion of hard tautologies using a nondeterministic generalization of instance complexity. We then show, under reasonable complexity-theoretic assumptions, that there are innnitely many propositional tautologies that are hard to prove in any sound propositional proof system.
متن کاملProof complexity of intuitionistic implicational formulas
We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of intuitionistic extended Frege (EF ) or substitution Frege (SF ) proofs up to a polynomial. On the other hand, EF proofs in the implicational fragment of IPC p...
متن کاملPolynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies
A grid graph has rectangularly arranged vertices with edges permitted only between orthogonally adjacent vertices. The st -connectivity principle states that it is not possible to have a red path of edges and a green path of edges which connect diagonally opposite corners of the grid graph unless the paths cross somewhere. We prove that the propositional tautologies which encode the st -connect...
متن کاملComputational complexities of axiomatic extensions of monoidal t-norm based logic
We study the computational complexity of some axiomatic extensions of the monoidal t-Norm based logic (MTL), namely NM corresponding to the logic of the so-called nilpotent minimum t-norm (due to Fodor [8]); and SMTL corresponding to left-continuous strict t-norms, introduced by Esteva (and others) in [4] and [5]. In particular, we show that the sets of 1-satisfiable and positively satisfiable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 113 شماره
صفحات -
تاریخ انتشار 2001